



lst = [90, 89, 66, 37, 98, 23]

# 求和
def sum(lst):
    if len(lst) == 1:
        return lst[0]
    else:
        v = lst.pop()
        return v+sum(lst)
print(sum(lst))

# 求n的阶乘
def mul(n):
    if n ==1:
        return 1
    else:
        return n*mul(n-1)

print(mul(4))

# 求第n个斐波那契数列数是多少
# 1 1 2 3 5 8 13 31 34 55

def fbnq(n):
    if n == 1 or n == 2:
        return 1
    else:
        return fbnq(n-1)+fbnq(n-2)


print(fbnq(10))